Convexity in Discrete Space
نویسندگان
چکیده
This paper looks at axioms for convexity, and shows how they can be applied to discrete spaces. Two structures for a discrete geometry are considered: oriented matroids, and cell complexes. Oriented matroids are shown to have a structure which naturally satisfies the axioms for being a convex geometry. Cell complexes are shown to give rise to various different notions of convexity, one of which satisfies the convexity axioms, but the others also provide valid notions of convexity in particular contexts. Finally, algorithms are investigated to validate the sets of a matroid, and to compute the convex hull of a subset of an oriented matroid.
منابع مشابه
On difference sequence spaces defined by Orlicz functions without convexity
In this paper, we first define spaces of single difference sequences defined by a sequence of Orlicz functions without convexity and investigate their properties. Then we extend this idea to spaces of double sequences and present a new matrix theoretic approach construction of such double sequence spaces.
متن کاملA Helly theorem in weakly modular space
The d-convex sets in a metric space are those subsets which include the metric interval between any two of its elements. Weak modularity is a certain interval property for triples of points. The d-convexity of a discrete weakly modular space X coincides with the geodesic convexity of the graph formed by the two-point intervals in X. The Helly number of such a space X turns out to be the same as...
متن کاملDiscrete Midpoint Convexity
For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of the line segment. Midpoint convexity is a well-known characterization of ordinary convexity under very mild assumptions. For a function defined on the integer...
متن کاملConvexity in Tree Spaces
We study the geometry of metrics and convexity structures on the space of phylogenetic trees, which is here realized as the tropical linear space of all ultrametrics. The CAT(0)-metric of Billera-Holmes-Vogtman arises from the theory of orthant spaces. While its geodesics can be computed by the Owen-Provan algorithm, geodesic triangles are complicated. We show that the dimension of such a trian...
متن کامل